Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations
نویسندگان
چکیده مقاله:
In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.
منابع مشابه
gauss-sidel and successive over relaxation iterative methods for solving system of fuzzy sylvester equations
in this paper, we present gauss-sidel and successive over relaxation (sor) iterative methods for finding the approximate solution system of fuzzy sylvester equations (sfse), ax + xb = c, where a and b are two m*m crisp matrices, c is an m*m fuzzy matrix and x is an m*m unknown matrix. finally, the proposed iterative methods are illustrated by solving one example.
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملA New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملfinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
a matrix $pintextmd{c}^{ntimes n}$ is called a generalized reflection matrix if $p^{h}=p$ and $p^{2}=i$. an $ntimes n$ complex matrix $a$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $p$ if $a=pap$ ($a=-pap$). in this paper, we introduce two iterative methods for solving the pair of matrix equations $axb=c$ and $dxe=f$ over reflexiv...
متن کاملPreconditioned Galerkin and minimal residual methods for solving Sylvester equations
This paper presents preconditioned Galerkin and minimal residual algorithms for the solution of Sylvester equations AX XB = C. Given two good preconditioner matricesM and N for matrices A and B, respectively, we solve the Sylvester equations MAXN MXBN =MCN. The algorithms use the Arnoldi process to generate orthonormal bases of certain Krylov subspaces and simultaneously reduce the order of Syl...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 3 شماره 2
صفحات 51- 60
تاریخ انتشار 2014-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023